From Tableaux to Automata for Description Logics
نویسندگان
چکیده
This paper investigates the relationship between automataand tableau-based inference procedures for Description Logics. To be more precise, we develop an abstract notion of what a tableau-based algorithm is, and then show, on this abstract level, how tableau-based algorithms can be converted into automata-based algorithms. In particular, this allows us to characterize a large class of tableau-based algorithms that imply an ExpTime upper-bound for reasoning in the description logics for which such an algorithm exists.
منابع مشابه
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predicates, such as ≤ or =. Until now, reasoning with concrete domains has been studied predominantly in the context of tableaux and automata calculi. In this paper, we present a general approach for concrete domain reasoni...
متن کاملTableaus and Automata for Description Logics
In this paper, we briefly present three different approaches at examining the relation between tableaus and automata, and possibly combining their advantages in the context of testing satisfiability of description logic concepts. The first approach tries to transfer the efficiency of tableaus to automata by performing the automata emptiness test with a tableau algorithm. The second one examines...
متن کاملBlocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as concept satisfiability. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-c...
متن کاملSI! Automata Can Show PSPACE Results for Description Logics
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTi...
متن کاملEXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
The description logic SHI extends the basic description logic ALC with transitive roles, role hierarchies and inverse roles. The known tableau-based decision procedure [9] for SHI exhibit (at least) NEXPTIME behaviour even though SHI is known to be EXPTIME-complete. The automata-based algorithms for SHI often yield optimal worst-case complexity results, but do not behave well in practice since ...
متن کامل